On the Triple-Error-Correcting Cyclic Codes
نویسنده
چکیده
We consider a class of 3-error-correcting cyclic codes of length 2−1 over the two-element field F2. The generator polynomial of a code of this class has zeroes α, α i +1 and α j , where α is a primitive element of the field F2m . In short, {1, 2+1, 2 +1} refers to the zero set of these codes. Kasami in 1971 and Bracken and Helleseth in 2009, showed that cyclic codes with zeroes {1, 2 + 1, 2 + 1} and {1, 2 + 1, 2 + 1} respectively are 3-error correcting, where gcd(l,m) = 1. We present a sufficient condition so that the zero set {1, 2 +1, 2 +1}, gcd(l,m) = 1 gives a 3-error-correcting cyclic code. The question for p > 3 is open. In addition, we determine all the 3-error-correcting cyclic codes in the class {1, 2 + 1, 2 + 1} for m < 20. We investigate their weight distribution via their duals and observe that they have the same weight distribution as 3-error-correcting BCH codes for m < 14. Further our experiment shows that these codes are not equivalent to the 3-error-correcting BCH code in general. We also study the Schaub algorithm which determines a lower bound of the minimum distance of a cyclic code. We introduce a pruning strategy to improve the Schaub algorithm. Finally we study the cryptographic property of a Boolean function, called spectral immunity which is directly related to the minimum distance of cyclic codes over F2m . We apply the improved Schaub algorithm in order to find a lower bound of the spectral immunity of a Boolean function related to the zero set {1, 2 + 1, 2 + 1}.
منابع مشابه
A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملOn a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code
In a recent paper, No, Golomb, Gong, Lee, and Gaal conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present correspondence it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error correcting code having the...
متن کامل(19) United States Correcting Wom Codes, Coding Strong Single and Multiple Error Correcting Wom Codes, Coding Methods and Devices Priority Claim and Reference to Related Application
Yaakobi et al. (57) ABSTRACT Preferred embodiments of the invention provide WOM cod ing methods and electronic devices With error correcting codes that provide single, double and triple error correction. Preferred codes of the invention also the following property: if the code corrects tWo/three errors it has tWo/three parts of redundancy bits. For double error correction, if only one part of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011